Good-for-games $\omega$-Pushdown Automata

The Triple-Pair Construction for Weighted $\omega$-Pushdown Automata

Let S be a complete star-omega semiring and Σ be an alphabet. For a weighted ω-pushdown automaton P with stateset {1, . . . ,n}, n ≥ 1, we show that there exists a mixed algebraic system over a complete semiring-semimodule pair ((S≪ Σ ≫),(S≪ Σ ≫)) such that the behavior ‖P‖ of P is a component of a solution of this system. In case the basic semiring is B or N we show that there exists a mixed c...

Regularity Problems for Weak Pushdown ω-Automata and Games

We show that the regularity and equivalence problems are decidable for deterministic weak pushdown ω-automata, giving a partial answer to a question raised by Cohen and Gold in 1978. We prove the decidability by a reduction to the corresponding problems for deterministic pushdown automata on finite words. Furthermore, we consider the problem of deciding for pushdown games whether a winning stra...

Omega-Continuous Semirings, Algebraich Systems and Pushdown Automata

Are Good-for-Games Automata Good for Probabilistic Model Checking?

The potential double exponential blow-up for the generation of deterministic ω-automata for linear temporal logic formulas motivates research on weaker forms of determinism. One of these notions is the goodfor-games property that has been introduced by Henzinger and Piterman together with an algorithm for generating good-for-games automata from nondeterministic Büchi automata. The contribution ...

How Deterministic are Good-For-Games Automata?

In good for games (GFG) automata, it is possible to resolve nondeterminism in a way that only depends on the past and still accepts all the words in the language. The motivation for GFG automata comes from their adequacy for games and synthesis, wherein general nondeterminism is inappropriate. We continue the ongoing effort of studying the power of nondeterminism in GFG automata. Initial indica...